首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   18533篇
  免费   3044篇
  国内免费   2441篇
化学   14045篇
晶体学   174篇
力学   295篇
综合类   216篇
数学   5208篇
物理学   4080篇
  2024年   39篇
  2023年   265篇
  2022年   422篇
  2021年   773篇
  2020年   1008篇
  2019年   835篇
  2018年   700篇
  2017年   710篇
  2016年   875篇
  2015年   762篇
  2014年   917篇
  2013年   1796篇
  2012年   1117篇
  2011年   1086篇
  2010年   1012篇
  2009年   1226篇
  2008年   1236篇
  2007年   1177篇
  2006年   1141篇
  2005年   974篇
  2004年   924篇
  2003年   843篇
  2002年   584篇
  2001年   529篇
  2000年   444篇
  1999年   399篇
  1998年   355篇
  1997年   259篇
  1996年   228篇
  1995年   273篇
  1994年   227篇
  1993年   144篇
  1992年   146篇
  1991年   80篇
  1990年   62篇
  1989年   75篇
  1988年   58篇
  1987年   42篇
  1986年   37篇
  1985年   53篇
  1984年   37篇
  1983年   11篇
  1982年   22篇
  1981年   25篇
  1980年   25篇
  1979年   12篇
  1978年   9篇
  1977年   10篇
  1976年   7篇
  1975年   13篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
2.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, ν(G) the order of G, κ(G) the connectivity of G and k a positive integer such that k(ν(G)?2)/2. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets V1 and V2 is defined to be Hamiltonian-laceable if such that |V1|=|V2| and for every pair of vertices pV1 and qV2, there exists a Hamiltonian path in G with endpoints p and q, or |V1|=|V2|+1 and for every pair of vertices p,qV1,pq, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition (X,Y). Define bn(G) to be a maximum integer such that 0bn(G)<min{|X|,|Y|} and (1) for each non-empty subset S of X, if |S||X|?bn(G), then |N(S)||S|+bn(G), and if |X|?bn(G)<|S||X|, then N(S)=Y; and (2) for each non-empty subset S of Y, if |S||Y|?bn(G), then |N(S)||S|+bn(G), and if |Y|?bn(G)<|S||Y|, then N(S)=X; and (3) bn(G)=0 if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition (X,Y) such that |X|=|Y| and bn(G)>0. In this paper, we show that if ν(G)2κ(G)+4bn(G)?4, then G is Hamiltonian-laceable; or if ν(G)>6bn(G)?2, then for every pair of vertices xX and yY, there is an (x,y)-path P in G with |V(P)|6bn(G)?2. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.  相似文献   
3.
4.
5.
6.
Yandong Guo 《中国物理 B》2022,31(12):127201-127201
Controlling the spin transport at the single-molecule level, especially without the use of ferromagnetic contacts, becomes a focus of research in spintronics. Inspired by the progress on atomic-level molecular synthesis, through first-principles calculations, we investigate the spin-dependent electronic transport of graphene nanoflakes with side-bonded functional groups, contacted by atomic carbon chain electrodes. It is found that, by rotating the functional group, the spin polarization of the transmission at the Fermi level could be switched between completely polarized and unpolarized states. Moreover, the transition between spin-up and spin-down polarized states can also be achieved, operating as a dual-spin filter. Further analysis shows that, it is the spin-dependent shift of density of states, caused by the rotation, that triggers the shift of transmission peaks, and then results in the variation of spin polarization. Such a feature is found to be robust to the length of the nanoflake and the electrode material, showing great application potential. Those findings may throw light on the development of spintronic devices.  相似文献   
7.
We report, for the first time, a detailed crystallographic study of the supramolecular arrangement for a set of zinc(II) Schiff base complexes containing the ligand 2,6-bis((E)-((2-(dimethylamino)ethyl)imino)methyl)-4-R-phenol], where R=methyl/tert-butyl/chloro. The supramolecular study acts as a pre-screening tool for selecting the compartmental ligand R of the Schiff base for effective binding with a targeted protein, bovine serum albumin (BSA). The most stable hexagonal arrangement of the complex [Zn − Me] (R=Me) stabilises the ligand with the highest FMO energy gap (ΔE=4.22 eV) and lowest number of conformations during binding with BSA. In contrast, formation of unstable 3D columnar vertebra for [Zn − Cl] (R=Cl) tend to activate the system with lowest FMO gap (3.75 eV) with highest spontaneity factor in molecular docking. Molecular docking analyses reported in terms of 2D LigPlot+ identified site A, a cleft of domains IB, IIIA and IIIB, as the most probable protein binding site of BSA. Arg144, Glu424, Ser428, Ile455 and Lys114 form the most probable interactions irrespective of the type of compartmental ligands R of the Schiff base whereas Arg185, Glu519, His145, Ile522 act as the differentiating residues with ΔG=−7.3 kcal mol−1.  相似文献   
8.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].  相似文献   
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号